t = int(input())
s = [int(i) for i in input().split()]
total = sum(s)
even_count = 0
odd_count = 0
for i in s:
if i % 2 == 0:
even_count += 1
else:
odd_count += 1
if t % 2 == 0:
if total % 2 == 0:
print(t - odd_count)
else:
print(odd_count)
else:
if total % 2 == 0:
print(even_count)
else:
print(odd_count)#include<bits/stdc++.h>
using namespace std ;
int main(){
int n;
cin>>n;
int arr[n];
int odd=0,even=0;
for (int i = 0; i < n; i++)
{
cin>>arr[i];
if (arr[i]%2==1)
{
odd++;
}
}
even=n-odd;
if (odd%2==0)
{
cout<<even<<endl;
}
else{
cout<<odd<<endl;
}
}492A - Vanya and Cubes | 217A - Ice Skating |
270A - Fancy Fence | 181A - Series of Crimes |
1638A - Reverse | 1654C - Alice and the Cake |
369A - Valera and Plates | 1626A - Equidistant Letters |
977D - Divide by three multiply by two | 1654B - Prefix Removals |
1654A - Maximum Cake Tastiness | 1649A - Game |
139A - Petr and Book | 1612A - Distance |
520A - Pangram | 124A - The number of positions |
1041A - Heist | 901A - Hashing Trees |
1283A - Minutes Before the New Year | 1654D - Potion Brewing Class |
1107B - Digital root | 25A - IQ test |
785A - Anton and Polyhedrons | 1542B - Plus and Multiply |
306A - Candies | 1651C - Fault-tolerant Network |
870A - Search for Pretty Integers | 1174A - Ehab Fails to Be Thanos |
1169A - Circle Metro | 780C - Andryusha and Colored Balloons |